Computing Semigroups with Error Control
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 16 February 2021Accepted: 04 October 2021Published online: 14 2022Keywordssemigroups, error control, contour methods, resolvent, infinite dimensions, spectral methodsAMS Subject Headings65J08, 65M15, 65N35, 47A10, 46N40Publication DataISSN (print): 0036-1429ISSN (online): 1095-7170Publisher: Society for Industrial and Applied MathematicsCODEN: sjnaam
منابع مشابه
Tutorial { Computing with Semigroups in Gap
Over the course of a decade GAP has come to be the most widely used tool for computational group theory. Due to its ready availability { it is free and is ported to many platforms { GAP's user base is already numbered in the thousands, and its functionality is being extended through the eeorts of a growing number of enthusiastic share package authors around the world, together with GAP's core d...
متن کاملComputing Transformation Semigroups
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of a group and an action. They provide for local computations, concerning a single R-class, without computing the whole semigroup, as well as for computing the global structure of the semigroup. The algorithms have been ...
متن کاملComputing automorphisms of semigroups
In this paper an algorithm is presented that can be used to calculate the automorphism group of a finite transformation semigroup. The general algorithm employs a special method to compute the automorphism group of a finite simple semigroup. As an application of the algorithm, all the automorphism groups of semigroup of order at most 7 and of the multiplicative semigroups of some group rings ar...
متن کاملComputing finite semigroups
Using a variant of Schreier’s Theorem, and the theory of Green’s relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to which these results apply include many important classes: transformation semigroups, partial permutation semigroups and inverse semigroups, partition monoids...
متن کاملParallel algorithms for computing finite semigroups
In this paper, we present two algorithms based on the Froidure-Pin Algorithm for computing a finite semigroup. If U is any semigroup, and A be a subset of U , then we denote by 〈A〉 the least subsemigroup of U containing A. If B is any other subset of U , then, roughly speaking, the first algorithm we present describes how to use any information about 〈A〉, that has been found using the Froidure-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2022
ISSN: ['0036-1429', '1095-7170']
DOI: https://doi.org/10.1137/21m1398616